// ========================================================================= //

// includes
#include "stdio.h"
#include "stdlib.h"
#include "time.h"
#include "string.h"
#include "limits.h"
#include "float.h"



#define JOTAI_NUM_RANDS_ 25

const unsigned rand_primes[JOTAI_NUM_RANDS_] = {179, 103, 479, 647, 229, 37, 271, 557, 263, 607, 18743, 50359, 21929, 48757, 98179, 12907, 52937, 64579, 49957, 52567, 507163, 149939, 412157, 680861, 757751};

int next_i() {
  int counter = 0;
  return rand_primes[(++counter)%JOTAI_NUM_RANDS_];
}

float next_f() {
  int counter = 0;
  return rand_primes[(++counter)%JOTAI_NUM_RANDS_] / 757751.0F;
} 


// Usage menu
void usage() {
    printf("%s", "Usage:\n\
    prog [ARGS]\n\
\nARGS:\n\
       0            int-bounds\n\
       1            big-arr\n\
       2            big-arr-10x\n\
\n\
");

}


// ------------------------------------------------------------------------- //

#define NULL ((void*)0)
typedef unsigned long size_t;  // Customize by platform.
typedef long intptr_t; typedef unsigned long uintptr_t;
typedef long scalar_t__;  // Either arithmetic or pointer type.
/* By default, we understand bool (as a convenience). */
typedef int bool;
#define false 0
#define true 1

/* Forward declarations */
typedef  struct TYPE_2__   TYPE_1__ ;

/* Type definitions */
typedef  int u64 ;
struct TYPE_2__ {int max_pages; int page_shift; scalar_t__ max_maps; } ;
struct mthca_fmr {scalar_t__ maps; TYPE_1__ attr; } ;

/* Variables and functions */
 int EINVAL ; 

__attribute__((used)) static inline int mthca_check_fmr(struct mthca_fmr *fmr, u64 *page_list,
				  int list_len, u64 iova)
{
	int i, page_mask;

	if (list_len > fmr->attr.max_pages)
		return -EINVAL;

	page_mask = (1 << fmr->attr.page_shift) - 1;

	/* We are getting page lists, so va must be page aligned. */
	if (iova & page_mask)
		return -EINVAL;

	/* Trust the user not to pass misaligned data in page_list */
	if (0)
		for (i = 0; i < list_len; ++i) {
			if (page_list[i] & ~page_mask)
				return -EINVAL;
		}

	if (fmr->maps >= fmr->attr.max_maps)
		return -EINVAL;

	return 0;
}

// ------------------------------------------------------------------------- //

int main(int argc, char *argv[]) {

    if (argc != 2) {
        usage();
        return 1;
    }

    int opt = atoi(argv[1]);
    switch(opt) {


    // int-bounds
    case 0:
    {
          // static_instructions_O0 : 17
          // dynamic_instructions_O0 : 17
          // ------------------------------- 
          // static_instructions_O1 : 8
          // dynamic_instructions_O1 : 8
          // ------------------------------- 
          // static_instructions_O2 : 8
          // dynamic_instructions_O2 : 8
          // ------------------------------- 
          // static_instructions_O3 : 8
          // dynamic_instructions_O3 : 8
          // ------------------------------- 
          // static_instructions_Ofast : 8
          // dynamic_instructions_Ofast : 8
          // ------------------------------- 
          // static_instructions_Os : 8
          // dynamic_instructions_Os : 8
          // ------------------------------- 
          // static_instructions_Oz : 8
          // dynamic_instructions_Oz : 8
          // ------------------------------- 

          int list_len = 100;
        
          int iova = 100;
        
          int _len_fmr0 = 1;
          struct mthca_fmr * fmr = (struct mthca_fmr *) malloc(_len_fmr0*sizeof(struct mthca_fmr));
          for(int _i0 = 0; _i0 < _len_fmr0; _i0++) {
              fmr[_i0].maps = ((-2 * (next_i()%2)) + 1) * next_i();
          fmr[_i0].attr.max_pages = ((-2 * (next_i()%2)) + 1) * next_i();
          fmr[_i0].attr.page_shift = ((-2 * (next_i()%2)) + 1) * next_i();
          fmr[_i0].attr.max_maps = ((-2 * (next_i()%2)) + 1) * next_i();
        
        
          }
        
          int _len_page_list0 = 1;
          int * page_list = (int *) malloc(_len_page_list0*sizeof(int));
          for(int _i0 = 0; _i0 < _len_page_list0; _i0++) {
            page_list[_i0] = ((-2 * (next_i()%2)) + 1) * next_i();
          }
        
          int benchRet = mthca_check_fmr(fmr,page_list,list_len,iova);
          printf("%d\n", benchRet); 
          free(fmr);
          free(page_list);
        
        break;
    }


    // big-arr
    case 1:
    {
          // static_instructions_O0 : 17
          // dynamic_instructions_O0 : 17
          // ------------------------------- 
          // static_instructions_O1 : 8
          // dynamic_instructions_O1 : 8
          // ------------------------------- 
          // static_instructions_O2 : 8
          // dynamic_instructions_O2 : 8
          // ------------------------------- 
          // static_instructions_O3 : 8
          // dynamic_instructions_O3 : 8
          // ------------------------------- 
          // static_instructions_Ofast : 8
          // dynamic_instructions_Ofast : 8
          // ------------------------------- 
          // static_instructions_Os : 8
          // dynamic_instructions_Os : 8
          // ------------------------------- 
          // static_instructions_Oz : 8
          // dynamic_instructions_Oz : 8
          // ------------------------------- 

          int list_len = 255;
        
          int iova = 255;
        
          int _len_fmr0 = 65025;
          struct mthca_fmr * fmr = (struct mthca_fmr *) malloc(_len_fmr0*sizeof(struct mthca_fmr));
          for(int _i0 = 0; _i0 < _len_fmr0; _i0++) {
              fmr[_i0].maps = ((-2 * (next_i()%2)) + 1) * next_i();
          fmr[_i0].attr.max_pages = ((-2 * (next_i()%2)) + 1) * next_i();
          fmr[_i0].attr.page_shift = ((-2 * (next_i()%2)) + 1) * next_i();
          fmr[_i0].attr.max_maps = ((-2 * (next_i()%2)) + 1) * next_i();
        
        
          }
        
          int _len_page_list0 = 65025;
          int * page_list = (int *) malloc(_len_page_list0*sizeof(int));
          for(int _i0 = 0; _i0 < _len_page_list0; _i0++) {
            page_list[_i0] = ((-2 * (next_i()%2)) + 1) * next_i();
          }
        
          int benchRet = mthca_check_fmr(fmr,page_list,list_len,iova);
          printf("%d\n", benchRet); 
          free(fmr);
          free(page_list);
        
        break;
    }


    // big-arr-10x
    case 2:
    {
          // static_instructions_O0 : 17
          // dynamic_instructions_O0 : 17
          // ------------------------------- 
          // static_instructions_O1 : 8
          // dynamic_instructions_O1 : 8
          // ------------------------------- 
          // static_instructions_O2 : 8
          // dynamic_instructions_O2 : 8
          // ------------------------------- 
          // static_instructions_O3 : 8
          // dynamic_instructions_O3 : 8
          // ------------------------------- 
          // static_instructions_Ofast : 8
          // dynamic_instructions_Ofast : 8
          // ------------------------------- 
          // static_instructions_Os : 8
          // dynamic_instructions_Os : 8
          // ------------------------------- 
          // static_instructions_Oz : 8
          // dynamic_instructions_Oz : 8
          // ------------------------------- 

          int list_len = 10;
        
          int iova = 10;
        
          int _len_fmr0 = 100;
          struct mthca_fmr * fmr = (struct mthca_fmr *) malloc(_len_fmr0*sizeof(struct mthca_fmr));
          for(int _i0 = 0; _i0 < _len_fmr0; _i0++) {
              fmr[_i0].maps = ((-2 * (next_i()%2)) + 1) * next_i();
          fmr[_i0].attr.max_pages = ((-2 * (next_i()%2)) + 1) * next_i();
          fmr[_i0].attr.page_shift = ((-2 * (next_i()%2)) + 1) * next_i();
          fmr[_i0].attr.max_maps = ((-2 * (next_i()%2)) + 1) * next_i();
        
        
          }
        
          int _len_page_list0 = 100;
          int * page_list = (int *) malloc(_len_page_list0*sizeof(int));
          for(int _i0 = 0; _i0 < _len_page_list0; _i0++) {
            page_list[_i0] = ((-2 * (next_i()%2)) + 1) * next_i();
          }
        
          int benchRet = mthca_check_fmr(fmr,page_list,list_len,iova);
          printf("%d\n", benchRet); 
          free(fmr);
          free(page_list);
        
        break;
    }

    default:
        usage();
        break;

    }

    return 0;
}
